A completeness problem for pattern generation in tessellation automata
نویسندگان
چکیده
منابع مشابه
Cellular Automata in the Triangular Tessellation
For t he discussion below t he following definit ions are helpful. A semito-talistic CA rule is a rul e for a cellular aut omaton (CA) where (a) we tally t he living neighbors t o a cell without regard to their orient atio n wit h respect t o th at cell, and (b) t he ru le applied t o a cell may depend upon its current status. A lifelike rule (LFR rul e) is a semit otalist ic CA rul e where (1)...
متن کاملDISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...
متن کاملPattern Generation by Cellular Automata (Invited Talk)
A one-dimensional cellular automaton is a discrete dynamical system where a sequence of symbols evolves synchronously according to a local update rule. We discuss simple update rules that make the automaton perform multiplications of numbers by a constant. If the constant and the number base are selected suitably the automaton becomes a universal pattern generator: all finite strings over its s...
متن کاملDASTWAR: a tool for completeness estimation in magnitude-size plane
Today, great observatories around the world, devote a substantial amount of observing time to sky surveys. The resulted images are inputs of source finder modules. These modules search for the target objects and provide us with source catalogues. We sought to quantify the ability of detection tools in recovering faint galaxies regularly encountered in deep surveys. Our approach was based on com...
متن کاملPattern Generation with Cellular Automata in Hexagonal Modular Spaces
This paper presents new methods for the generation of hexagonal patterns, based on cellular automata in smallsized regular hexagonal modular spaces. The patterns are intended to be used for procedural content generation in computer games, but could also be applied for diverse ends, such as logotype design and architecture.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1970
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(70)80005-8